When is a Polygonal Pyramid Number again Polygonal?
نویسندگان
چکیده
منابع مشابه
Straightening Polygonal Arcs and Convexifying Polygonal Cycles
Consider a planar linkage, consisting of disjoint polygonal arcs and cycles of rigid bars joined at incident endpoints (polygonal chains), with the property that no cycle surrounds another arc or cycle. We prove that the linkage can be continuously moved so that the arcs become straight, the cycles become convex, and no bars cross while preserving the bar lengths. Furthermore, our motion is pie...
متن کاملStraighting Polygonal Arcs and Convexifying Polygonal Cycles
Consider a planar linkage, consisting of disjoint polygonal arcs and cycles of rigid bars joined at incident endpoints (polygonal chains), with the property that no cycle surrounds another arc or cycle. We prove that the linkage can be continuously moved so that the arcs become straight, the cycles become convex, and no bars cross while preserving the bar lengths. Furthermore, our motion is pie...
متن کاملPolygonal valuations
We develop a valuation theory for generalized polygons similar to the existing theory for dense near polygons. This valuation theory has applications for the study and classification of generalized polygons that have full subpolygons as subgeometries.
متن کاملPolygonal Numbers
In the article the formal characterization of triangular numbers (famous from [15] and words “EYPHKA! num = ∆ + ∆ + ∆”) [17] is given. Our primary aim was to formalize one of the items (#42) from Wiedijk’s Top 100 Mathematical Theorems list [33], namely that the sequence of sums of reciprocals of triangular numbers converges to 2. This Mizar representation was written in 2007. As the Mizar lang...
متن کاملOn the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space
Given a convex polygonal robot B with k edges capable of translation and rotation, and a set of polygonal obstacles {A1, . . . , Am} each with ni sides and n = ∑ m i=1 ni, Leven and Sharir [1] prove that the number of critical placements of B at which it makes 3 simultaneous contacts with the obstacles but does not intersect their interior is O(knλ6(kn)), where λs(u) is the maximum length of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2002
ISSN: 0035-7596
DOI: 10.1216/rmjm/1030539614